Counterterrorism: Privately Clustering a Radical Social Network Data
نویسندگان
چکیده
منابع مشابه
Clustering on Dynamic Social Network Data
This paper presents a reference data set along with a labeling for graph clustering algorithms, especially for those handling dynamic graph data. We implemented a modification of Iterative Conductance Cutting and a spectral clustering. As base data set we used a filtered part of the Enron corpus. Different cluster measurements, as intra-cluster density, inter-cluster sparseness, and Q-Modularit...
متن کاملA fast clustering algorithm for mining social network data
Many groups with diverse convictions are interacting online. Interactions in online communities help people to engage each other and enhance understanding across groups. Online communities include multiple sub-communities whose members are similar due to social ties, characteristics, or ideas on a topic. In this research, we are interested in understanding the changes in the relative size and a...
متن کاملMulti-View Clustering for Mining Heterogeneous Social Network Data∗
Uncovering community structure is a core challenge in social network analysis. This is a significant challenge for large networks where there is a single type of relation in the network (e.g. friend or knows). In practice there may be other types of relation, for instance demographic or geographic information, that also reveal network structure. Uncovering structure in such multi-relational net...
متن کاملCollecting Telemetry Data Privately
The collection and analysis of telemetry data from user’s devices is routinely performed by many software companies. Telemetry collection leads to improved user experience but poses significant risks to users’ privacy. Locally differentially private (LDP) algorithms have recently emerged as the main tool that allows data collectors to estimate various population statistics, while preserving pri...
متن کاملA Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data
The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions on Machine Learning and Artificial Intelligence
سال: 2017
ISSN: 2054-7390
DOI: 10.14738/tmlai.54.3204